Kripke-Platek Set Theory and the Anti-Foundation Axiom
نویسنده
چکیده
The paper investigates the strength of the Anti-Foundation Axiom, AFA, on the basis of Kripke-Platek set theory without Foundation. It is shown that the addition of AFA considerably increases the proof theoretic strength. 1. Introduction Intrinsically circular phenomena have come to the attention of researchers in diiering elds such as mathematical logic, computer science, artiicial intelligence, linguistics, cognitive science, and philosophy. Logicians rst explored set theories whose universe contains what are called non-wellfounded sets, or hypersets (cf. 6], 2]). But the area was considered rather exotic until these theories were put to use in developing rigorous accounts of circular notions in computer science (cf. 4]). Instead of the Foundation Axiom these set theories adopt the so-called Anti
منابع مشابه
Fragments of Kripke{platek Set Theory with Innnity
In this paper we shall investigate fragments of Kripke{Platek set theory with Innnity which arise from the full theory by restricting Foundation to n Foundation, where n 2. The strength of such fragments will be characterized in terms of the smallest ordinal such that L is a model of every 2 sentence which is provable in the theory.
متن کاملAbout the strength of operational regularity
We analyze the consistency strength of regularity on the basis of Feferman’s operational set theory OST. Our main result shows that regularity over OST for operations corresponds to regularity with respect to set-theoretic functions in frameworks like Kripke-Platek set theory. As a consequence, we obtain that OST plus the operational axiom (Inac) is consistency-equivalent to Kripke-Platek set t...
متن کاملRelativized ordinal analysis: The case of Power Kripke-Platek set theory
The paper relativizes the method of ordinal analysis developed for KripkePlatek set theory to theories which have the power set axiom. We show that it is possible to use this technique to extract information about Power Kripke-Platek set theory, KP(P). As an application it is shown that whenever KP(P) + AC proves a Π2 statement then it holds true in the segment Vτ of the von Neumann hierarchy, ...
متن کاملAn Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...
متن کاملAn ordinal analysis of admissible set theory using recursion on ordinal notations ∗ Jeremy Avigad
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 47 شماره
صفحات -
تاریخ انتشار 2001